Computer Bridge - A Big Win for AI Planning

نویسندگان

  • Stephen J. J. Smith
  • Dana S. Nau
  • Thomas A. Throop
چکیده

niques is now the world champion computer program in the game of Contract Bridge. As reported in The New York Times and The Washington Post, this program—a new version of Great Game Products’ BRIDGE BARON program—won the Baron Barclay World Bridge Computer Challenge, an international competition hosted in July 1997 by the American Contract Bridge League. It is well known that the game tree search techniques used in computer programs for games such as Chess and Checkers work differently from how humans think about such games. In contrast, our new version of the BRIDGE BARON emulates the way in which a human might plan declarer play in Bridge by using an adaptation of hierarchical task network planning. This article gives an overview of the planning techniques that we have incorporated into the BRIDGE BARON and discusses what the program’s victory signifies for research on AI planning and game playing.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Success in Spades: Using AI Planning Techniques to Win the World Championship of Computer Bridge

The latest world-championship competition for computer bridge programs was the Baron Barclay World Bridge Computer Challenge, hosted in July 1997 by the American Contract Bridge League. As reported in The New York Times and The Washington Post, the competition’s winner was a new version of Great Game Products’ Bridge Baron program. This version, Bridge Baron 8, has since gone on the market; and...

متن کامل

Current Trends in Automated Planning

representations of future behavior ... usually a set of actions, with temporal and other constraints on them, for execution by some agent or agents.1 One motivation for automated-planning research is theoretical: planning is an important component of rational behavior—so if one objective of artificial intelligence is to grasp the computational aspects of intelligence, then certainly planning pl...

متن کامل

Real Time Planning for Path-finding in Computer Games

The relationship between AI and computer games could be qualified as “bi-directional inverse”. Modern AI techniques use old games –chess, bridge, go, etc..as test fields while modern computer games use old AI techniques as A*. The fast evolution of this kind of entertainment has multiplied the AI requirements of the new developments evidencing the necessity to reuse the work already done in the...

متن کامل

Compact Representation of Sets of Binary Constraints

We address the problem of representing big sets of binary constraints compactly. Binary constraints in the form of 2literal clauses are ubiquitous in propositional formulae that represent real-world problems ranging from model-checking problems in computer-aided verification to AI planning problems. Current satisfiability and constraint solvers are applicable to very big problems, and in some c...

متن کامل

An Ai Planning Approach for Generating Big Data Workflows

The scale of big data causes the compositions of extract-transform-load (ETL) workflows to grow increasingly complex. With the turnaround time for delivering solutions becoming a greater emphasis, stakeholders cannot continue to afford to wait the hundreds of hours it takes for domain experts to manually compose a workflow solution. This paper describes a novel AI planning approach that facilit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • AI Magazine

دوره 19  شماره 

صفحات  -

تاریخ انتشار 1998